Nested Tracking Graphs
نویسندگان
چکیده
منابع مشابه
Target Tracking with Unknown Maneuvers Using Adaptive Parameter Estimation in Wireless Sensor Networks
Abstract- Tracking a target which is sensed by a collection of randomly deployed, limited-capacity, and short-ranged sensors is a tricky problem and, yet applicable to the empirical world. In this paper, this challenge has been addressed a by introducing a nested algorithm to track a maneuvering target entering the sensor field. In the proposed nested algorithm, different modules are to fulfill...
متن کاملNested Term Graphs
We report on work in progress on ‘nested term graphs’ for formalizing higher-order terms (e.g. finite or infinite λ -terms), including those expressing recursion (e.g. terms in the λ -calculus with letrec). The idea is to represent the nested scope structure of a higher-order term by a nested structure of term graphs. Based on a signature that is partitioned into atomic and nested function symb...
متن کاملEla Nested Graphs with Bounded Second Largest ( Signless Laplacian
Nested split and double nested graphs (commonly named nested graphs) are considered. General statements regarding the signless Laplacian spectra are proven, and the nested graphs whose second largest signless Laplacian eigenvalue is bounded by a fixed integral constant are studied. Some sufficient conditions are provided and a procedure for classifying such graphs in particular cases is provide...
متن کاملFast Algorithms for Indices of Nested Split Graphs Approximating Real Complex Networks
We present a method based on simulated annealing to obtain a nested split graph that approximates a real complex graph. This is used to compute a number of graph indices using very efficient algorithms that we develop, leveraging the geometrical properties of nested split graphs. Practical results are given for six graphs from such diverse areas as social networks, communication networks, word ...
متن کاملA Complete Proof System for Nested Term Graphs
Nested Term Graphs are syntactic representations of cyclic term graphs. Via a simple translation they contain-terms as a subset. There exists a characterization of the-terms that unwind to the same tree, presented as a complete proof system. This paper gives a similar characterization for Nested Term Graphs. The semantics of tree unwinding is presented via bisimulations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Graph. Forum
دوره 36 شماره
صفحات -
تاریخ انتشار 2017